Linear representations of formal loops

A representation of an object in a category is an abelian group in the corresponding comma category. In this paper, we derive the formulas describing linear representations of objects in the category of formal loops and formal loop homomorphisms and apply them to obtain a new approach to the representation theory of formal Moufang loops and Malcev algebras based on Moufang elements. Certain ‘non-associative Moufang symmetry’ of groups is revealed.     

Integral representation and estimation of harmonic functions in the quaternionic half space

In this article, we discuss the integral representation of quaternionic harmonic functions in the half space with the general boundary condition. Next, we derive a lower bound from an upper one for quaternionic harmonic functions. These results generalize some of the classic results from the case of plane to the case of noncommutative quaterninionic half space. Copyright © 2017 John Wiley & Sons, Ltd.     

Mehler's formulas for the univariate complex Hermite polynomials and applications

We give 2 widest Mehler's formulas for the univariate complex Hermite polynomials , by performing double summations involving the products and . They can be seen as the complex analogues of the classical Mehler's formula for the real Hermite polynomials. The proof of the first one is based on a generating function giving rise to the reproducing kernel of the generalized Bargmann space of level m. The second Mehler's formula generalizes the one appearing as a particular case of the so‐called Kibble‐Slepian formula. The proofs we present here are direct and more simpler. Moreover, direct applications are given and remarkable identities are derived.     

基于Hilbert变换的LFM检测与估计

LFM(线性调频)信号是一类重要的非平稳信号,其完全被初始频率和调频斜率两个参量表征,而LFM信号的检测与估计问题是信号处理中最为重要的研究热点之一.由于调频信号在时频平面内有较好的聚集性,通常使用时频分析的方法对其进行检测和估计.线性正则变换是经典时频分布的广义形式,对LFM信号具有很好的能量聚集特性,在现有的线性正则域Hilbert变换的基础上,提出了一种不需要谱峰搜索而快速检测LFM信号和估计其参数的方法,并且通过仿真实例验证了所提出方法的优越性.     

Constructing near spanning trees with few local inspections

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded‐degree graph. Given an edge e in G we would like to decide whether e belongs to a connected subgraph consisting of edges (for a prespecified constant ), where the decision for different edges should be consistent with the same subgraph . Can this task be performed by inspecting only a constant number of edges in G ? Our main results are:

• We show that if every t‐vertex subgraph of G has expansion then one can (deterministically) construct a sparse spanning subgraph of G using few inspections. To this end we analyze a “local” version of a famous minimum‐weight spanning tree algorithm.
• We show that the above expansion requirement is sharp even when allowing randomization. To this end we construct a family of 3‐regular graphs of high girth, in which every t‐vertex subgraph has expansion . We prove that for this family of graphs, any local algorithm for the sparse spanning graph problem requires inspecting a number of edges which is proportional to the girth.

© 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 183–200, 2017     

Convergent sequences of sparse graphs: A large deviations approach

Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. Different notions of similarity (and hence convergence) of sparse graphs are of interest in different communities. In probability theory and combinatorics, the notion of Benjamini‐Schramm convergence, also known as left‐convergence, is used quite frequently. Statistical physicists are interested in the the existence of the thermodynamic limit of free energies, which leads naturally to the notion of right‐convergence. Combinatorial optimization problems naturally lead to so‐called partition convergence, which relates to the convergence of optimal values of a variety of constraint satisfaction problems. The relationship between these different notions of similarity and convergence is, however, poorly understood. In this paper we introduce a new notion of convergence of sparse graphs, which we call Large Deviations or LD‐convergence, and which is based on the theory of large deviations. The notion is introduced by “decorating” the nodes of the graph with random uniform i.i.d. weights and constructing corresponding random measures on and . A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on . The corresponding large deviations rate function can be interpreted as the limit object of the sparse graph sequence. In particular, we can express the limiting free energies in terms of this limit object. We then establish that LD‐convergence implies the other three notions of convergence discussed above, and at the same time establish several previously unknown relationships between the other notions of convergence. In particular, we show that partition‐convergence does not imply left‐ or right‐convergence, and that right‐convergence does not imply partition‐convergence. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 52–89, 2017     

平稳小波在高精度重力仪信号处理中的应用

为有效地消除噪声对重力仪测量数据的影响,提高重力异常测量值的精度,在分析平稳小波多尺度分析原理的基础上,将平稳小波应用到重力仪数据处理中,并与传统小波多尺度分析进行了对比.理论分析和仿真实验表明,平稳小波和传统小波都能在一定程度上抑制噪声对高精度重力仪测量数据的影响,但平稳小波的性能优于传统小波.     

基于微机械陀螺的MIMU关键技术

针对基于微机械陀螺的MIMU关键技术，对其进行研究和解决。参加美国JDAM性能指标和导航精度要求，计算陀螺性能参数：采用多级大容量的滤波器及有源电流限制电路，同时电源的输入端接入EMC滤波器，以提高电磁兼容性，并能抵抗浪涌和拉偏的能力；DSP实现信号实时采集，采用高次多项式拟合预处理去除数据野值；根据GJB729评估方法，利用利用蒙特卡罗方法仿真进行精度评估；最后按照GJB813进行可靠性分析。